Attempt to backwards-engineer a Weil-weighted analog for "Zeta"
In Mike's Zeta Function Working Page, we see that zeta can be thought of as a superposition of weighted "cosine accuracy" functions for every unreduced rational:
The cosines are weighted by 1/(nd)a. However, it is of interest to replace n*d with max(n,d)^2 to see if we can derive a Weil-weighted analog of the Zeta function. I will denote this function by f(s).
Let's do a few manipulations, to try to work our way backwards to f(s):
At this point I get stuck. Having a generalized zeta function inside a sum isn't exactly the easiest function to manipulate.
Mike's attempt
Let's start here
and change the denominator to max(n,d)^2a
OK, so now let's split it into three sub-series -- n=d, n>d, n<d
OK, so for every term in the middle sum, there's a corresponding term on the right where n and d are interchanged. So if n=p and d=q in the middle sum, and p>q, then we get the following two terms (the left from the middle sum, the right from the right sum)
OK, let's throw some extra sin terms in there which cancel out to make this look more like Euler's identity
OK, so we can throw these extra terms back in the original three-part series and get this
Also, we can add a magical sin term that evaluates to 0 on the left side, yielding
Euler baby, Euler
OK, let's make it all one sum again
Now, let's note that max(n,d)^2a = (nd)^a * max(n/d,d/n)^a, and that max(n/d,d/n) = exp(|log(n/d)|). So we get
Attempt to backwards-engineer a Weil-weighted analog for "Zeta"
In Mike's Zeta Function Working Page, we see that zeta can be thought of as a superposition of weighted "cosine accuracy" functions for every unreduced rational:
The cosines are weighted by 1/(nd)a. However, it is of interest to replace n*d with max(n,d)^2 to see if we can derive a Weil-weighted analog of the Zeta function. I will denote this function by f(s).
Let's do a few manipulations, to try to work our way backwards to f(s):
At this point I get stuck. Having a generalized zeta function inside a sum isn't exactly the easiest function to manipulate.
Mike's attempt
Let's start here
and change the denominator to max(n,d)^2a
OK, so now let's split it into three sub-series -- n=d, n>d, n<d
OK, so for every term in the middle sum, there's a corresponding term on the right where n and d are interchanged. So if n=p and d=q in the middle sum, and p>q, then we get the following two terms (the left from the middle sum, the right from the right sum)
OK, let's throw some extra sin terms in there which cancel out to make this look more like Euler's identity
OK, so we can throw these extra terms back in the original three-part series and get this
Also, we can add a magical sin term that evaluates to 0 on the left side, yielding
Euler baby, Euler
OK, let's make it all one sum again
Now, let's note that max(n,d)^2a = (nd)^a * max(n/d,d/n)^a, and that max(n/d,d/n) = exp(|log(n/d)|). So we get
The right terms become
Alright!! I'm going to bed.